例句與造句

1. In the query , the path expression
   在該查詢中， exist ( )方法中的路徑表達(dá)式
2. If your queries generally specify path expressions on
   如果查詢通常對
3. This column is searched for path expressions in the query
   搜索此列可獲得查詢中的路徑表達(dá)式。
4. In this case , the xquery path expression inside the braces ,
   在本例中，將對大括號中的xquery路徑表達(dá)式
5. 3 ) improves the extended path expressions based xml querying theory framework
   3 )發(fā)展了基于擴(kuò)展路徑表達(dá)式的xml查詢理論框架。
6. It's difficult to find path expression in a sentence. 用path expression造句挺難的
7. Document trees are used as xml data model and path expressions as view definition language
   全文以樹型xml為數(shù)據(jù)模型,路徑表達(dá)式為視圖定義語言。
8. As we have seen in the previous chapters , we are selecting and filtering elements with either a path expression or with a flwor expression
   如同在前幾章里所看到的那樣，我們使用路徑表達(dá)式或flwor表達(dá)式來選擇和過濾元素。
9. To make full use of the orderliness of xml documents while querying , this thesis improves the extended path expressions based xml querying theory framework
   為了支持xml文檔的有序性查詢，本文發(fā)展了一種基于擴(kuò)展路徑表達(dá)式的xml查詢理論框架。
10. Although a primary xml index avoids having to shred the xml binary large objects at run time , it may not provide the best performance for queries based on path expressions
    雖然主xml索引避免了在運(yùn)行時(shí)拆分xml二進(jìn)制大型對象，但是它不會為基于路徑表達(dá)式的查詢提供最好的性能。
11. This means that xquery consists of several kinds of expressions , such as path expressions , conditional expressions , and element constructors , that can be composed with full generality
    這就意味著xquery是由多種表達(dá)式構(gòu)成的，如路徑表達(dá)式、條件表達(dá)式以及元素構(gòu)造函數(shù)，是完全通用的。
12. The paper addressed algebra rewriting - based optimization techniques . at the same time , the author quantified the complex degree of xml data to assist the optimization of queries with regular path expressions
    設(shè)計(jì)了一種xml查詢語言代數(shù)操作符表示，并在代數(shù)表示的基礎(chǔ)上，研究了基于代數(shù)重寫xml查詢優(yōu)化的方法和可能性。
13. Describes xquery primary expressions , path expressions , sequence expressions , arithmetic comparison and logical expressions , xquery construction , flwor expression , conditional and quantified expressions , and various expressions on sequence types
    介紹xquery主表達(dá)式、路徑表達(dá)式、序列表達(dá)式、算術(shù)比較和邏輯表達(dá)式、 xquery構(gòu)造、 flwor表達(dá)式、條件和定量表達(dá)式以及序列類型的各種表達(dá)式。
14. On one hand , extended path expressions are made simpler and more flexible by introducing wildcard into them , on the other hand , the time complexity of the algorithm is also reduced by putting forward a new kind of automata , namely automata with a stop set
    一方面通過在擴(kuò)展路徑表達(dá)式中引入通配符來降低查詢表達(dá)式編寫難度，提高查詢的效率；另一方面提出帶截止集自動機(jī)概念，進(jìn)一步降低了查詢計(jì)算的時(shí)間復(fù)雜度。
15. But with full exploitation of cmrs , the application can sometimes be tuned with simple object navigation path expressions to issue just one sql statement with zero or more inner joins to handle multi - cardinality navigations ; my friend stacy calls these " honking big " joins
    但通過充分利用cmr ，應(yīng)用程序有時(shí)可以用簡單的對象定位路徑表達(dá)式來協(xié)調(diào)，以發(fā)布僅僅一個(gè)sql語句（使用零個(gè)或者更多的內(nèi)部連接來處理多基數(shù)定位；我的朋友stacy將這些連接稱為" honking big "連接） 。
16. Main characteristics of dbxi are : 1 ) a new xml numbering scheme is adopted which enables each element in xml documents carries corresponding dtd structural information . 2 ) a path query with n elements ( or attributes ) and a predicate restriction can be implemented with only 0 or 2 structural join operations per xml document while at least n - 1 times of structural join operations are needed in xiss ( xiss is a kin xml indexing system developed by q . li and b . moon ) . 3 ) for a path expression that is not complying with any paths in xml documents , dbxi can give a judgment of no answer in much shorter time than that of sphinx , xiss , etc . experimental results demonstrate that dbxi can process path expressions much faster than lore sphinx and xiss do
    Dbxi的主要特點(diǎn)是： 1 )采用了新的xml編碼方法，使xml文檔中每個(gè)元素屬性的編碼攜帶了相應(yīng)的dtd結(jié)構(gòu)信息； 2 )對一個(gè)由n個(gè)元素屬性組成的有一個(gè)謂詞約束的路徑表達(dá)式， dbxi處理每個(gè)xml文檔，由同類系統(tǒng)xiss所需的至少n - 1次結(jié)構(gòu)連接運(yùn)算，降低至0次或2次結(jié)構(gòu)連接運(yùn)算； 3 )如果查詢路徑在待查xml文檔中不存在正確的匹配結(jié)構(gòu)， dbxi能夠在比國際上的sphinx和xiss等xml索引方法較短的時(shí)間內(nèi)給出無查詢結(jié)果的判斷。
更多例句：  下一頁